A Many-sorted Polyadic Modal Logic

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Notes on Many-Sorted Logic

Preface, p. vii Any reasonable logical system can be naturally translated into many-sorted first-order logic; thus many-sorted first-order logic is a universal logic. Since many-sorted logic can be translated into single-sorted first-order logic the latter is also universal. However, as will be seen in the course of this book, many-sorted logic faithfully interprets the semantics of the object ...

متن کامل

A Polyadic Modal -calculus a Polyadic Modal -calculus

The propositional-calculus of Kozen extends modal logic with xed points to achieve a powerful logic for expressing temporal properties of systems modelled by labelled transition systems. We further extend Kozen's logic with polyadic modalities to allow for expressing also quite naturally behavioural relations like bisimula-tion equivalence and simulation preorders. We show that the problem of m...

متن کامل

Defining New Universes in Many-sorted Logic. *

In this paper we develop definability theory in such a way that we allow to define new elements also, not only new relations on already existing elements. This is in harmony with our everyday mathematical practice, for example we define new entities when we define a geometry over a field. We will see that, in many respects, defining new elements is more harmonious in many-sorted logic than in o...

متن کامل

Discourse Consistency and Many-Sorted Logic

We propose the use of a many-sorted logic based on a boolean lattice of sorts, with polymorphic functions and predicates, for natural language understanding. This type of logic provides a unified framework for various problems such as discourse consistency verification, polysemy and "abuses" of terms, syntactic ambiguity solving and anaphora resolution. In addition, this logic enables intellige...

متن کامل

Quine's conjecture on many-sorted logic

Quine often argued for a simple, untyped system of logic rather than the typed systems that were championed by Russell and Carnap, among others. He claimed that nothing important would be lost by eliminating sorts, and the result would be additional simplicity and elegance. In support of this claim, Quine conjectured that every many-sorted theory is equivalent to a single-sorted theory. We make...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fundamenta Informaticae

سال: 2020

ISSN: 0169-2968,1875-8681

DOI: 10.3233/fi-2020-1921